Enhanced Teaching–Learning-Based Optimization Algorithm for the Mobile Robot Path Planning Problem

نویسندگان

چکیده

This research proposes an enhanced teaching–learning based optimization (ETLBO) algorithm to realize efficient path planning for a mobile robot. Four strategies are introduced accelerate the (TLBO) and optimize final path. Firstly, divide-and-conquer design, coupled with Dijkstra method, is developed problem transformation so as pave way deployment. Secondly, interpolation method utilized smooth traveling route well reduce dimensionality. Thirdly, opposition-based learning strategy embedded into initialization create initial solutions high qualities. Finally, novel, individual update established by hybridizing TLBO differential evolution (DE). Simulations on benchmark functions MRPP problems conducted, proposed ELTBO compared some state-of-the-art algorithms. The results show that, in most cases, performs better than other algorithms both optimality efficiency.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Memetic Algorithm Based Path Planning for a Mobile Robot

In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memetic algorithm. What is new in this work is a novel representation of solutions for evolutionary algorithms that is efficient, simple and also compatible with memetic algorithm. The new representation makes it possible ...

متن کامل

Enhanced Genetic Algorithm Based on Node Codes for Mobile Robot Path Planning

In this paper, a new Enhanced Genetic Algorithm (EGA) is used to find the best global path planning for a mobile robot according to a specific criterion. The EGA is enhanced by a new encoding method, new initial population creation method, new crossover and mutation operations as well as new additional operations correction operation and classification operation. The study considers the case wh...

متن کامل

Mobile Robot Dynamic Path Planning Based on Genetic Algorithm

In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13042291